Graphs with polynomially many minimal separators
نویسندگان
چکیده
We show that graphs do not contain a theta, pyramid, prism, or turtle as an induced subgraph have polynomially many minimal separators. This result is the best possible in sense there are with exponentially separators if only three of four subgraphs excluded. As consequence, polynomial time algorithm to solve maximum weight independent set problem for class (theta, turtle)-free graphs. Since every and contains even hole, this also implies (pyramid, hole)-free
منابع مشابه
Minimal Separators in Intersection Graphs
In this report, we present the intersection graphs and describe the role they play in computations of treewidth. We introduce minimal triangulations, minimal separators, potential maximal cliques and blocks as the main tools for exact computation and approximation of that important graph parameter. The first chapter is an introduction to the intersection graph theory. We give all the necessary ...
متن کاملGraphs with complete minimal k-vertex separators
G. A. Dirac characterized chordal graphs as those in which minimal vertex separators always induce complete subgraphs. I generalize a traditional (2-)vertex separator to a k-vertex separator — meaning a set S of vertices whose removal puts k independent vertices into k separate components. Generalizing Dirac’s theorem, the {P5, 2P3}-free chordal graphs are the graphs in which minimal k-separato...
متن کاملMinimal Triangulations for Graphs with "Few" Minimal Separators
We give a characterization of minimal triangulation of graphs using the notion of \maximal set of neighbor separators". We prove that if all the maximal sets of neighbor separators of some graphs can be computed in polynomial time, the treewidth of those graphs can be computed in polynomial time. This notion also uniies the already known algorithms computing the treewidth of several classes of ...
متن کاملMinimal separators in P4-sparse graphs
In this paper, we determine the minimal separators of P4-sparse graphs and establish bounds on their number. Specifically, we show that a P4-sparse graph G on n vertices and m edges has fewer than 2n/3 minimal separators of total description size at most 4m/3. The bound on the number of minimal separators is tight and is also tight for the class of cographs, a well known subclass of the P4-spar...
متن کاملEfficient Analysis of Graphs with Small Minimal Separators
We consider the class C of graphs whose minimal separators have a fixed bounded size. We give an O(nm)-time algorithm computing an optimal tree-decomposition of every graph in C with n vertices and m edges. Furthermore we make evident that many NP-complete problems are solvable in polynomial time when restricted to this class. Both claims hold although C contains graphs of arbitrarily large tre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2022
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.10.003